Efficient Prediction of Marsaglia-Zaman Random Number Generators

نویسنده

  • Eric Bach
چکیده

We show that the random number generator of Marsaglia and Zaman produces the successive digits of a rational -adic number. (The -adic number system generalizes -adic numbers to an arbitrary integer base .) Using continued fractions, we derive an efficient prediction algorithm for this generator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing the Tests: Using Random Number Generators to Improve Empirical Tests

The implementer of an empirical test for random number generators is faced with some difficult problems, especially if the test is based on a statistic which is known only approximately: How can the test be tested? How can the approximation be improved? When is it good enough? A number of principles can be applied to these problems. These principles are illustrated using implementations of the ...

متن کامل

Some portable very-long-period random number generators

It is found that a proposed random number generator r an2, recently presented in the Numerical Recipes column [W. H. Press and S. A. Teukolsky, Comput. Phys. 6, 521-524 (1992)], is a good one, but a number of generators are presented that are at least as good and are simpler, much faster, and with periods “billions and billions” of times longer. They are presented not necessarily to supplant ra...

متن کامل

Randomness by Design

“Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin.”1 John von Neumann’s famous dictum points an accusing finger at all who set their ordered minds to engender disorder. Much as in times past thieves, pimps, and actors carried on their profession with an uneasy conscience, so in this day scientists who devise random number generators suffer pa...

متن کامل

Xorshift random number generators from primitive polynomials

A class of xorshift random number generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a full period xorshift RNG from a given primitive polynomial. It is shown there is a weakness present in those RNGs and is suggested its improvement. A separate algorithm is also proposed which returns a full period xorshift generator with desired number of xorshift op...

متن کامل

Note on Marsaglia’s Xorshift Random Number Generators

Marsaglia (2003) has described a class of“xorshift”random number generators (RNGs) with periods 2 − 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR) generators using “exclusive or” (xor) operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1998